Hedonic coalition formation games: A new stability notion

نویسنده

  • Mehmet Karakaya
چکیده

This paper studies hedonic coalition formation games where each player’s preferences rely only upon the members of her coalition. A new stability notion under free exit-free entrymembership rights, referred to as strong Nash stability, is introducedwhich is stronger than both core and Nash stabilities studied earlier in the literature. Strong Nash stability has an analogue in non-cooperative games and it is the strongest stability notion appropriate to the context of hedonic coalition formation games. The weak top-choice property is introduced and shown to be sufficient for the existence of a strongly Nash stable partition. It is also shown that descending separable preferences guarantee the existence of a strongly Nash stable partition. Strong Nash stability under different membership rights is also studied. © 2011 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractional Hedonic Games: Individual and Group Stability

Coalition formation provides a versatile framework for analyzing cooperative behavior in multi-agent systems. In particular, hedonic coalition formation has gained considerable attention in the literature. An interesting class of hedonic games recently introduced by Aziz et al. [3] are fractional hedonic games. In these games, the utility an agent assigns to a coalition is his average valuation...

متن کامل

Shao-chin Sung; Dinko Dimitrov: Computational Complexity in Additive Hedonic Games Computational Complexity in Additive Hedonic Games *

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. ...

متن کامل

Individual-based stability in hedonic games depending on the best or worst players

We consider classes of hedonic games in which each player’s preferences over coalition structures are induced by the best player (Band B-hedonic games) or the worst player (Wand W-hedonic games) in his coalition. For these classes, which allow for concise representation, we analyze the computational complexity of deciding the existence of and computing individually stable, Nash stable, and indi...

متن کامل

ar X iv : 1 10 5 . 18 24 v 2 [ cs . G T ] 3 D ec 2 01 1 Individual - based stability in hedonic games depending on the best or worst players ∗

We consider hedonic coalition formation games in which each player has preferences over the other players and his preferences over coalition structures are based on the best player (B-/B-hedonic games) or the worst player (W /W-hedonic games) in his coalition. We show that for B-hedonic games, an individually stable partition is guaranteed to exist and can be computed efficiently. Similarly, th...

متن کامل

Hedonic coalition nets

In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ranging from multi-agent coordination to group formation in social networks. However, the practical application of hedonic games is hindered by the fact that the naive representation for such games is exponential in th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Social Sciences

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2011